"查查詞典"手機版
千萬人都在用的超大詞匯詞典翻譯APP
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.
詳細百科解釋